منابع مشابه
Chain Packings and Odd Subtree Packings
A chain packing H in a graph is a subgraph satisfying given degree constraints at the vertices. Its size is the number of odd degree vertices in the subgraph. An odd subtree packing is a chain packing which is a forest in which all non-isolated vertices have odd degree in the forest. We show that for a given graph and degree constraints, the size of a maximum chain packing and a maximum odd sub...
متن کاملDirected packings with block size 5 and odd v
Let DD(5, 1; v) denote the packing number of a directed packing with block size 5 and index unity. It has been determined in [10] that DD(5, 1; v) = l2(:-1 JJ where v even. In this paper, the values of DD(5, 1; v) for all v are determined, with the possible exceptions of v 15, 19, 27.
متن کاملClique packings and clique partitions of graphs without odd chordles cycles
In this paper we consider partitions (resp. packings) of graphs without odd chordless cycles into cliques of order at least 2. We give a structure theorem, min-max results and characterization theorems for this kind of partitions and packings.
متن کاملThe Existence of a Path-Factor without Small Odd Paths
A {P2, P5}-factor of a graph is a spanning subgraph of the graph each of whose components is isomorphic to either P2 or P5, where Pn denote the path of order n. In this paper, we show that if a graph G satisfies c1(G−X)+ 2 3c3(G−X) 6 4 3 |X|+ 1 3 for all X ⊆ V (G), then G has a {P2, P5}-factor, where ci(G − X) is the number of components C of G − X with |V (C)| = i. Moreover, it is shown that a...
متن کاملGeneration of Optimal Packings from Optimal Packings
We define two notions of generation between the various optimal packings Qm of m congruent disks in a subset K of R2. The first one that we call weak generation consists in getting Qn by removing m − n disks from Qm and by displacing the n remaining congruent disks which grow continuously and do not overlap. During a weak generation of Qn from Qm, we consider the contact graphs G(t) of the inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1989
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(89)80075-7